A simple linear algorithm for computing rectilinear 3-centers
نویسندگان
چکیده
منابع مشابه
A simple linear algorithm for computing rectilinear 3-centers
Rectilinear k-centers of a finite point set P R2 are the centers of at most k congruent axis-parallel squares of minimal size whose union covers P. This paper describes a linear time algorithm based on the prune-and-search paradigm to compute rectilinear 3-centers. The algorithm is elementary in the sense that it does not build on any sophisticated data structures or other algorithms, except fo...
متن کاملA simple linear algorithm for computing rectangle 3-centers
Rectangular p-centers of a nite planar point set P are the centers of at most p axis-parallel congruent squares of minimal size covering P . We give a simple linear time algorithm based on linear selection for the case p = 3. A linear algorithm for this problem is already known [7]. But it makes use of an LP -type [6] formulation of the problem with high combinatorial dimension (roughly 40) whi...
متن کاملA Simple Linear Algorithm for Computing Rectangular Centers
Rectangular p centers of a nite planar point set P are the centers of at most p axis parallel congruent squares of minimal size covering P We give a simple linear time algorithm based on linear selection for the case p A linear algorithm for this problem is already known But it makes use of an LP type formula tion of the problem with high combinatorial dimension roughly which makes it unlikely ...
متن کاملA SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2005
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2004.12.002